Marginal congestion cost on a dynamic network with queue spillbacks
نویسنده
چکیده
We formulate an empirical model of congestion for a network where queues may form and spill back from one link to another. Its purpose is to disentangle the dynamic effect that a marginal vehicle, on a given link and at a given time, has on the distribution of travel times experienced there and on connected links. We estimate a dynamic model, based on an unusually complete and accurate dataset from Danish motorways. Each data point contains information on the vehicle flow on a link during a five-minute interval, along with the average speed experienced by those vehicles as measured by timed license-plate matches. We use the results to estimate the marginal external cost of adding a vehicle to a link’s entry flow, as it is influenced by conditions on that link and on its downstream neighbor. Marginal congestion cost on a dynamic network with queue spillbacks Mogens Fosgerau and Kenneth A. Small
منابع مشابه
Dynamic network loading: a stochastic differentiable model that derives link state distributions
We present a dynamic network loading model that yields queue length distributions, accounts for spillbacks, and maintains a differentiable mapping from the dynamic demand on the dynamic queue lengths. The model also captures the spatial correlation of all queues adjacent to a node, and derives their joint distribution. The approach builds upon an existing stationary queueing network model that ...
متن کاملDynamic network loading: a differentiable model that derives link state distributions
We present a dynamic network loading model that yields queue length distributions, accounts for spillbacks, and maintains a differentiable mapping from the dynamic demand on the dynamic queue lengths. The approach builds upon an existing stationary queueing network model that is based on finite capacity queueing theory. The original model is specified in terms of a set of differentiable equatio...
متن کاملA finite capacity queueing network model capturing blocking, congestion and spillbacks
Analytic queueing network models constitute a flexible tool for the study of network flow. These aggregate models are simple to manipulate and their analytic aspect renders them suitable for use within an optimization framework. Analytic queueing network models often assume infinite capacity for all queues. For real systems this infinite capacity assumption does not hold, but is often maintaine...
متن کاملAn Improvement over Random Early Detection Algorithm: A Self-Tuning Approach
Random Early Detection (RED) is one of the most commonly used Active Queue Management (AQM) algorithms that is recommended by IETF for deployment in the network. Although RED provides low average queuing delay and high throughput at the same time, but effectiveness of RED is highly sensitive to the RED parameters setting. As network condition varies largely, setting RED's parameters with fixed ...
متن کاملA Simulation-based Approximation Algorithm for Dynamic Marginal Cost Pricing
This work offers a simulation-based approximation algorithm for dynamic marginal cost pricing (MCP) that is a direct extension of static MCP. The algorithm approximates the time-dependent marginal costs, and is incorporated into the inner approximation dynamic user equilibrium algorithm to evaluate the results of dynamic MCP, which are then compared to static assignment results with MCP from pr...
متن کامل